Name: Depth-First Search (DFS)
Description: A graph traversal algorithm that explores as far as possible along each branch before backtracking. It uses a stack (or recursion) to keep track of vertices to visit.
Time Complexity: O(V + E) where V is vertices and E is edges
Space Complexity: O(V) in worst case for recursion stack
Use Cases: Topological sorting, cycle detection, maze solving, web crawling
Traversal Order: Pre-order (root, left, right) for trees